Drawing Partially Embedded and Simultaneously Planar Graphs

Drawing Partially Embedded and Simultaneously Planar Graphs

We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem—to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph—and the simultaneous planarity problem—to find planar drawings of two graphs that coincide on shared vertices and edges. In both cases we show that if the required pl...

Drawing Simultaneously Embedded Graphs with Few Bends

Planar Drawing of Clustered Graphs

Graphs are often used to represent relational information. As the amount of information that we want to visualize becomes larger and more complicated, classical graph model tends to be insuucient. In this paper, we introduce and show how to draw a practical and simple graph structure known as clustered graphs. We present an algorithm which produces planar, straight-line, convex drawings of clus...

On Drawing Planar Angle Graphs

Recently, some advanced algorithms for straight line drawings of planar graphs have been introduced. However, these algorithms produce drawings with many small angles. Their drawings are not aesthetically nice. Our goal is to resolve these problems by a beautifier. We consider the angles of planar straight line drawings. In a first phase we compute maximal angles by repeatedly solving a linear ...

Drawing HV-Restricted Planar Graphs

A strict orthogonal drawing of a graph G = (V,E) in R is a drawing of G such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal or vertical line segment. A graph G is HV -restricted if each of its edges is assigned a horizontal or vertical orientation. A strict orthogonal drawing of an HV -restricted graph G is good if it is planar and respects the edge orien...